Joint Compartmented Threshold Access Structures
نویسندگان
چکیده
A secret sharing scheme is a method of distributing a secret value among members of a group such that only certain coalitions of these participants can find the secret. A subset of users that can recover the secret is called a qualified coalition, and the set of all qualified coalitions is called the access structure. An access structure is called monotone if every coalition containing a qualified coalition as a subset is also a qualified coalition. An important class of access structures is the compartmented threshold access structure, where the user set is partitioned into compartments, and a qualified subset has to satisfy a certain threshold at each compartment as well as the overall threshold. Such access structures may be desirable to guarantee fair representation across different sections of a community. Compartmented access structures were introduced in [6], and several secret sharing schemes realizing such access structures were proposed in [1, 3, 7]. Ideality and perfectness are two important criteria for a secret sharing scheme in terms of efficiency and security, respectively. A secret sharing scheme is said to be ideal if the size of the share assigned to each participant is no larger than the size of the secret; and it is said to be perfect if an unqualified coalition can gain no information about the secret. It is shown that all monotone access structures can be realized by a perfect secret sharing scheme [4]. Thus, an important question for an access structure is whether it is possible to find a secret sharing scheme that is both ideal and perfect. Traditionally, a compartmented access structure is assumed to consist of disjoint compartments [6, 1, 3, 7]. We generalize this concept such that the compartments are not necessarily disjoint, and refer to such an access structures as a joint compartmented threshold access structure (JCTAS). In this paper, we give necessary conditions for the existence of an ideal and perfect scheme for JCTASes. Then we propose an ideal and almost surely perfect construction for these access structures.
منابع مشابه
Efficient Construction of Visual Cryptographic Scheme for Compartmented Access Structures
In this paper, we consider a special type of secret sharing scheme known as Visual Cryptographic Scheme (VCS) in which the secret reconstruction is done visually without any mathematical computation unlike other secret sharing schemes. We put forward an efficient direct construction of a visual cryptographic scheme for compartmented access structure which generalizes the access structure for th...
متن کاملGeneral Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
Threshold secret sharing based on the Chinese remainder theorem has been considered by Mignotte [23] and Asmuth and Bloom [1]. In this paper we demonstrate that the Chinese remainder theorem can be used for realizing more general access structures, as the compartmented or the weighted threshold ones. We also prove that there exist some non-weighted threshold access structures whose realizations...
متن کاملCompartmented Threshold RSA Based on the Chinese Remainder Theorem
In this paper we combine the compartmented secret sharing schemes based on the Chinese remainder theorem with the RSA scheme in order to obtain, as a novelty, a dedicated solution for compartmented threshold decryption or compartmented threshold digital signature generation. AMS Subject Classification: 94A60, 94A62, 11A07
متن کاملCompartmented Secret Sharing Based on the Chinese Remainder Theorem
A secret sharing scheme starts with a secret and then derives from it certain shares (or shadows) which are distributed to users. The secret may be recovered only by certain predetermined groups. In case of compartmented secret sharing, the set of users is partitioned into compartments and the secret can be recovered only if the number of participants from any compartment is greater than a fixe...
متن کاملSecret Sharing Schemes with Applications in Security Protocols
Preface A secret sharing scheme starts with a secret and then derives from it certain shares (or shadows) which are distributed to users. The secret may be recovered only by certain predetermined groups which belong to the access structure. Secret sharing schemes have been independently introduced by Blakley [12] and Shamir [134] as a solution for safeguarding cryptographic keys. Secret sharing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013